Polynomial interpolation and cubature over polygons
نویسندگان
چکیده
منابع مشابه
Polynomial interpolation and cubature over polygons
We have implemented a Matlab code to compute Discrete Extremal Sets (of Fekete and Leja type) on convex or concave polygons, together with the corresponding interpolatory cubature formulas. The method works by QR and LU factorizations of rectangular Vandermonde matrices on Weakly Admissible Meshes (WAMs) of polygons, constructed by polygon quadrangulation. 2000 AMS subject classification: 65D05...
متن کاملGaussian Cubature and Bivariate Polynomial Interpolation
Gaussian cubature is used to study bivariate polynomial interpolation based on the common zeros of quasi-orthogonal polynomials.
متن کاملGauss-Green cubature over spline curvilinear polygons
We have implemented in Matlab a Gauss-like cubature formula over bivariate domains with a piecewise regular boundary, which is tracked by splines of maximum degree p (spline curvilinear polygons). The formula is exact for polynomials of degree at most 2n− 1 using N ∼ cmn nodes, 1 ≤ c ≤ p, m being the total number of points given on the boundary. It does not need any decomposition of the domain,...
متن کاملBivariate Polynomial Interpolation over Nonrectangular Meshes
In this paper, by means of a new recursive algorithm of non-tensor-producttyped divided differences, bivariate polynomial interpolation schemes are constructed over nonrectangular meshes firstly, which is converted into the study of scattered data interpolation. And the schemes are different as the number of scattered data is odd and even, respectively. Secondly, the corresponding error estimat...
متن کاملOn Sparse Polynomial Interpolation over Finite Fields
We present a Las Vegas algorithm for interpolating a sparse multivariate polynomial over a finite field, represented with a black box. Our algorithm modifies the algorithm of BenOr and Tiwari in 1988 for interpolating polynomials over rings with characteristic zero to characteristic p by doing additional probes. One of the best algorithms for sparse polynomial interpolation over a finite field ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2011
ISSN: 0377-0427
DOI: 10.1016/j.cam.2011.05.013